Continuous Curvelet Transform: II. Discretization and Frames

نویسندگان

  • Emmanuel J. Candès
  • David L. Donoho
چکیده

We develop a unifying perspective on several decompositions exhibiting directional parabolic scaling. In each decomposition, the individual atoms are highly anisotropic at fine scales, with effective support obeying the parabolic scaling principle length ≈ width. Our comparisons allow to extend Theorems known for one decomposition to others. We start from a Continuous Curvelet Transform f → Γf (a, b, θ) of functions f(x1, x2) on R, with parameter space indexed by scale a > 0, location b ∈ R, and orientation θ. The transform projects f onto a curvelet γabθ, yielding coefficient Γf (a, b, θ) = 〈f, γabθ〉; the corresponding curvelet γabθ is defined by parabolic dilation in polar frequency domain coordinates. We establish a reproducing formula and Parseval relation for the transform, showing that these curvelets provide a continuous tight frame. The CCT is closely related to a continuous transform introduced by Hart Smith in his study of Fourier Integral Operators. Smith’s transform is based on true affine parabolic scaling of a single mother wavelet, while the CCT can only be viewed as true affine parabolic scaling in euclidean coordinates by taking a slightly different mother wavelet at each scale. Smith’s transform, unlike the CCT, does not provide a continuous tight frame. We show that, with the right underlying wavelet in Smith’s transform, the analyzing elements of the two transforms become increasingly similar at increasingly fine scales. We derive a discrete tight frame essentially by sampling the CCT at dyadic intervals in scale aj = 2 −j , at equispaced intervals in direction, θj, = 2π2 −j/2 , and equispaced sampling on a rotated anisotropic grid in space. This frame is a complexification of the ‘Curvelets 2002’ frame constructed by Emmanuel Candès et al. [1, 2, 3]. We compare this discrete frame with a composite system which at coarse scales is the same as this frame but at fine scales is based on sampling Smith’s transform rather than the CCT. We are able to show a very close approximation of the two systems at fine scales, in a strong operator norm sense. Smith’s continuous transform was intended for use in forming molecular decompositions of Fourier Integral Operators (FIO’s). Our results showing close approximation of the curvelet frame by a composite frame using true affine paraboblic scaling at fine scales allow us to cross-apply Smith’s results, proving that the discrete curvelet transform gives sparse representations of FIO’s of order zero. This yields an alternate proof of a recent result of Candès and Demanet about the sparsity of FIO representations in discrete curvelet frames.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Novel Automated Method for Minirhizotron Image Analysis: Root Detection using Curvelet Transform

In this article a new method is introduced for distinguishing roots and background based on their digital curvelet transform in minirhizotron images. In the proposed method, the nonlinear mapping is applied on sub-band curvelet components followed by boundary detection using energy optimization concept. The curvelet transform has the excellent capability in detecting roots with different orient...

متن کامل

Synchrosqueezed Curvelet Transform for Two-Dimensional Mode Decomposition

This paper introduces the synchrosqueezed curvelet transform as an optimal tool for two-dimensional mode decomposition of wavefronts or banded wave-like components. The synchrosqueezed curvelet transform consists of a generalized curvelet transform with application dependent geometric scaling parameters, and a synchrosqueezing technique for a sharpened phase space representation. In the case of...

متن کامل

Wavelets on the Two-Sphere and other Conic Sections

We survey the construction of the continuous wavelet transform (CWT) on the two-sphere. Then we discuss the discretization of the spherical CWT, obtaining various types of discrete frames. Finally we give some indications on the construction of a CWT on other conic sections.

متن کامل

Higher - Dimensional Discrete Smith Curvelet Transform : a Parallel Algorithm

We revisit Smith’s frame of curvelets and discretize it making use of the USFFT as developed by Dutt and Roklin, and Beylkin. In the discretization, we directly approximate the underlying dyadic parabolic decomposition, its (rotational) symmetry, and approximate all the necessary decay estimates in phase space with arbitrary accuracy. Numerically, our transform is unitary. Moreover, if we apply...

متن کامل

A New Object Tracking Algorithm Based on the Fast Discrete Curvelet Transform

Tracking object from video sequences has become a very popular problem in the field of computer vision. Many algorithms have been proposed to solve this problem. Combined with the energy of curvelet coefficients and Kalman filter method, a new object tracking algorithm is proposed based on fast discrete curvelet transform. Firstly, this algorithm is initialized with the establishment of a movin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2003